Accelerated projected steepest descent method for nonlinear inverse problems with sparsity constraints

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerated Projected Steepest Descent Method for Nonlinear Inverse Problems with Sparsity Constraints

This paper is concerned with the construction of an iterative algorithm to solve nonlinear inverse problems with an `1 constraint. One extensively studied method to obtain a solution of such an `1 penalized problem is iterative soft-thresholding. Regrettably, such iteration schemes are computationally very intensive. A subtle alternative to iterative soft-thresholding is the projected gradient ...

متن کامل

Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints

Regularization of ill-posed linear inverse problems via l1 penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an l1 penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to l1-constraints, using a gradient method, with projection on l1-balls. The correspondin...

متن کامل

Steepest descent method for solving zero-one nonlinear programming problems

In this paper we use steepest descent method for solving zero-one nonlinear programming problem. Using penalty function we transform this problem to an unconstrained optimization problem and then by steepest descent method we obtain the original problem optimal solution. 2007 Elsevier Inc. All rights reserved.

متن کامل

An analysis of a multi-level projected steepest descent iteration for nonlinear inverse problems in Banach spaces subject to stability constraints

We consider nonlinear inverse problems described by operator equations in Banach spaces. Assuming conditional stability of the inverse problem, that is, assuming that stability holds on a compact, convex subset of the domain of the operator, we introduce a novel nonlinear projected steepest descent iteration and analyze its convergence to an approximate solution given limited accuracy data. We ...

متن کامل

A Convergence Analysis of a Multi-level Projected Steepest Descent Iteration for Nonlinear Inverse Problems in Banach Spaces Subject to Stability Constraints

We consider nonlinear inverse problems described by operator equations in Banach spaces. Assuming conditional stability of the inverse problem, that is, assuming that stability holds on a closed, convex subset of the domain of the operator, we introduce a novel nonlinear projected steepest descent iteration and analyze its convergence to an approximate solution given limited accuracy data. We p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Inverse Problems

سال: 2010

ISSN: 0266-5611,1361-6420

DOI: 10.1088/0266-5611/26/2/025007